An alternate Approach to Compute the Reliability of a Network with Imperfect Nodes using Binary Decision Diagrams
نویسنده
چکیده
In this paper i have adopted an efficient approach for calculating the reliability of the computer communication network with the help of binary decision diagram. The computer communication network has imperfect nodes and imperfect links. It means the nodes as well as the communication links may fail with known probability. The network is represented in the form of a directed graph. First i have found the reliability of the given network by applying the inclusionexclusion formula, which is an exact method to find the reliability of a network and then i have found the reliability of the given network with binary decision diagram. To find the reliability via binary decision diagram, we must order the nodes and the communication links of the given network by applying a proposed heuristic approach. I have found that the reliability obtained via binary decision diagram is equal to the reliability obtained by inclusion-exclusion formula. I have also shown that the generated binary decision diagram is of the minimum size.
منابع مشابه
Computing Network Reliability with Imperfect Nodes Using Modified Binary Decision Diagram
Since more and more enterprises become dependent upon computer communication network or networked computing applications particularly after the growth of local area network, wide area network and internet. Therefore failure of a single component may directly affect the functioning of the network. The nodes and the edges may fail in any real network. In this paper we have proposed an efficient a...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملEstimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization
In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a ne...
متن کاملComparison of Binary and Multi-Variate Hybrid Decision Diagram Algorithms for K-Terminal Reliability
The Ordered Binary Decision Diagram (OBDD) has been efficiently used to compute the communication network (CN) reliability (REL). The boundary set method (BS) is used to improve the efficiency of the OBDD approach, while the augmented OBDD diagrams (OBDD-A) that stores CN information in its nodes has been proposed to solve other CN performance metrics in addition to REL. The hybrid OBDD (OBDD-H...
متن کاملComputing all-terminal reliability of stochastic networks with Binary Decision Diagrams
In this paper, we propose an algorithm based on Binary Decision Diagram (BDD) for computing all-terminal reliability. It is defined as the probability that the nodes in the network can communicate to each other, taking into account the possible failures of network links. The effectiveness of this approach is demonstrated by performing experiments on several large networks represented by stochas...
متن کامل